Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
261	Stratospheric Chemistry Exercise 5 Computational Exercise: Problem Set 5 Distribution Add to Reading List Source URL: www.iac.ethz.ch Language: English - Date: 2014-11-12 04:07:40
262	Spring 2015 BIL 721: Computational Photography Instructor: Asst. Prof. Aykut Erdem PROBLEM ASSIGNMENT 2 Add to Reading List Source URL: web.cs.hacettepe.edu.tr Language: English - Date: 2015-03-17 02:51:17
263	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 8 Due on April 3 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 Computational complexity theory Analysis of algorithms Mosaic Symmetry Tessellation Algorithm Time complexity Dynamic programming Euclidean algorithm Theoretical computer science Applied mathematics Mathematics
264	DELFT UNIVERSITY OF TECHNOLOGY REPORTSIMPLE-type preconditioners for the Oseen problem M. ur Rehman, Add to Reading List Source URL: www.ewi.tudelft.nl Language: English - Date: 2011-05-11 08:17:01 Computational science Preconditioner Partial differential equations Numerical analysis Computational fluid dynamics Iterative method Navier–Stokes equations Schur complement SIMPLE algorithm Numerical linear algebra Mathematics Mathematical analysis
265	Co m pu tati on a l Provenance Provenance for Computational Tasks: A Survey The problem of systematically capturing and managing provenance for computational Add to Reading List Source URL: vgc.poly.edu Language: English - Date: 2011-07-16 10:04:53 Management VisTrails Provenance Workflow Collaboratory Windows Workflow Foundation Kepler scientific workflow system Scientific workflow system Workflow technology Business Systems engineering
266	UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m. Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Mathematical optimization NP-complete P versus NP problem NP Time complexity Vertex cover Hamiltonian path Theoretical computer science Computational complexity theory Applied mathematics
267	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
268	DELFT UNIVERSITY OF TECHNOLOGY REPORTLITERTURE STUDY: NUMERICAL METHODS FOR SOLVING STEFAN PROBLEMS 1 Add to Reading List Source URL: www.ewi.tudelft.nl Language: English - Date: 2011-05-11 08:17:04 Applied mathematics Numerical analysis Computational science Stefan problem Numerical methods for ordinary differential equations Discretization Method of lines Explicit and implicit methods Computational fluid dynamics Mathematics Mathematical analysis Partial differential equations
269	M IDTERM S OLUTIONS C OURSE : CPS230 Problem 1: M ODIFIED -D IJKSTRA (G = (V, E), s ∈ V ) Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2009-10-29 19:24:49 Mathematics Minimum spanning tree Theoretical computer science Computational complexity theory Spanning tree
270	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 NP-complete problems Complexity classes Bin packing problem NP Subset sum problem Partition problem Vertex cover Integer 3-partition problem Theoretical computer science Mathematics Computational complexity theory

UPDATE